Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
791	Register Allocation after Classical SSA Elimination is NP-complete Fernando Magno Quint˜ao Pereira Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2006-02-05 20:11:50 Static single assignment form Graph coloring Register allocation Graph Intersection graph Chordal graph Path decomposition Trapezoid graph Graph theory Theoretical computer science Mathematics
792	Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y Add to Reading List Source URL: www.cs.virginia.edu Language: English - Date: 1999-10-25 15:38:00 Spanning tree NP-complete problems Steiner tree problem NP-hard problems Quasi-bipartite graph Minimum spanning tree Rectilinear Steiner tree Vertex cover Matching Graph theory Theoretical computer science Mathematics
793	Degree Conditions of Fractional ID-k-factor-critical graphs∗ Renying Chang, Guizhen Liu† , Yan Zhu School of Mathematics, Shandong University Add to Reading List Source URL: www.emis.de Language: English - Date: 2010-07-23 03:44:37 Graph coloring Combinatorial optimization Matching Critical graph Bread bun NP-complete problems Graph theory Theoretical computer science Mathematics
794	A better approximation ratio for the Vertex Cover problem George Karakostas Dept. of Computing and Software Add to Reading List Source URL: www.cas.mcmaster.ca Language: English - Date: 2006-01-23 15:36:00 NP-complete problems Graph theory Linear programming Operations research Real algebraic geometry Semidefinite programming Vertex cover Graph coloring Matching Theoretical computer science Mathematics Computational complexity theory
795	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 1, pp. 61–[removed]) Add to Reading List Source URL: jgaa.info Language: English - Date: 2007-05-02 06:33:52 NP-complete problems Hamiltonian path Line graph Path Cubic graph Graph Travelling salesman problem Matching Neighbourhood Graph theory Mathematics Theoretical computer science
796	A New Approach to Incremental Topological Ordering Michael A. Bender∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2009-02-20 14:50:17 Search algorithms Network flow Topological sorting Directed acyclic graph Depth-first search Minor Tree NP-complete problems Spanning tree Graph theory Mathematics Combinatorics
797	Journal of Biological Engineering BioMed Central Add to Reading List Source URL: www.jbioleng.org Language: English Microbiology NP-complete problems Molecular genetics Genetics Hamiltonian path Hin recombinase Fertility factor Plasmid DNA Biology Graph theory Molecular biology
798	HAMILTONIAN PATHS IN CAYLEY GRAPHS Igor Pak Add to Reading List Source URL: www.math.ucla.edu Language: English - Date: 2009-01-31 18:34:10 Group theory Geometric group theory NP-complete problems Cayley graph Hamiltonian path Vertex-transitive graph Lovász conjecture Stallings theorem about ends of groups Graph theory Mathematics Algebraic graph theory
799	A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs DAVID J. PEARCE Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2007-01-25 16:40:07 Search algorithms Topological sorting Directed acyclic graph NP-complete problems Algorithm Depth-first search Longest path problem Path decomposition Graph theory Mathematics Theoretical computer science
800	1 A Self-Managed Distributed Channel Selection Add to Reading List Source URL: www.hamilton.ie Language: English - Date: 2006-03-06 06:37:18 Mathematics Graph coloring NP-complete problems Graph theory Radio resource management Carrier sense multiple access with collision avoidance Channel IEEE 802.11 Throughput Theoretical computer science Electronic engineering Network access

UPDATE